Neighborhood conditions for balanced independent sets in bipartite graphs
نویسندگان
چکیده
منابع مشابه
Neighborhood conditions for balanced independent sets in bipartite graphs
Let G be a balanced bipartite graph of order 2n and minimum degree (G) 3. If for every balanced independent set S of four vertices in G the neighborhood union jN(S)j > n then G is traceable, the circumference is at least 2n ? 2 and G contains a 2-factor (with one exceptional graph for the latter statement). If jN(S)j > n + 2 then G is hamiltonian.
متن کاملIndependent cycles and paths in bipartite balanced graphs
Bipartite graphs G = (L, R; E) and H = (L, R; E) are bi-placeabe if there is a bijection f : L ∪ R → L ∪ R such that f(L) = L and f(u)f(v) / ∈ E for every edge uv ∈ E. We prove that if G and H are two bipartite balanced graphs of order |G| = |H | = 2p ≥ 4 such that the sizes of G and H satisfy ‖ G ‖≤ 2p− 3 and ‖ H ‖≤ 2p− 2, and the maximum degree of H is at most 2, then G and H are bi-placeable...
متن کاملA graph polynomial for independent sets of bipartite graphs
We introduce a new graph polynomial that encodes interesting properties of graphs, for example, the number of matchings, the number of perfect matchings, and, for bipartite graphs, the number of independent sets (#BIS). We analyse the complexity of exact evaluation of the polynomial at rational points and show a dichotomy result: for most points exact evaluation is #P-hard (assuming the general...
متن کاملBohdan Zelinka INDEPENDENT SET DOMINATING SETS IN BIPARTITE GRAPHS
The paper continues the study of independent set dominating sets in graphs which was started by E. Sampathkumar. A subset D of the vertex set V (G) of a graph G is called a set dominating set (shortly sd−set) in G, if for each set X ⊆ V (G) −D there exists a set Y ⊆ D such that the subgraph 〈X ∪ Y 〉 of G induced by X ∪ Y is connected. The minimum number of vertices of an sd−set in G is called t...
متن کاملMaximal independent sets in bipartite graphs obtained from Boolean lattices
Attempts to enumeratemaximal antichains in Boolean lattices give rise to problems involving maximal independent sets in bipartite graphs whose vertex sets are comprised of adjacent levels of the lattice and whose edges correspond to proper containment. In this paper, we find bounds on the numbers of maximal independent sets in these graphs. © 2010 Elsevier Ltd. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1998
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(97)00042-3